numbers → d(0)
d(x) → if(le(x, nr), x)
if(true, x) → cons(x, d(s(x)))
if(false, x) → nil
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
nr → ack(s(s(s(s(s(s(0)))))), 0)
ack(0, x) → s(x)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
↳ QTRS
↳ Overlay + Local Confluence
numbers → d(0)
d(x) → if(le(x, nr), x)
if(true, x) → cons(x, d(s(x)))
if(false, x) → nil
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
nr → ack(s(s(s(s(s(s(0)))))), 0)
ack(0, x) → s(x)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
numbers → d(0)
d(x) → if(le(x, nr), x)
if(true, x) → cons(x, d(s(x)))
if(false, x) → nil
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
nr → ack(s(s(s(s(s(s(0)))))), 0)
ack(0, x) → s(x)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
numbers
d(x0)
if(true, x0)
if(false, x0)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
ACK(s(x), 0) → ACK(x, s(0))
ACK(s(x), s(y)) → ACK(s(x), y)
NUMBERS → D(0)
ACK(s(x), s(y)) → ACK(x, ack(s(x), y))
D(x) → IF(le(x, nr), x)
D(x) → NR
D(x) → LE(x, nr)
NR → ACK(s(s(s(s(s(s(0)))))), 0)
IF(true, x) → D(s(x))
LE(s(x), s(y)) → LE(x, y)
numbers → d(0)
d(x) → if(le(x, nr), x)
if(true, x) → cons(x, d(s(x)))
if(false, x) → nil
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
nr → ack(s(s(s(s(s(s(0)))))), 0)
ack(0, x) → s(x)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
numbers
d(x0)
if(true, x0)
if(false, x0)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
ACK(s(x), 0) → ACK(x, s(0))
ACK(s(x), s(y)) → ACK(s(x), y)
NUMBERS → D(0)
ACK(s(x), s(y)) → ACK(x, ack(s(x), y))
D(x) → IF(le(x, nr), x)
D(x) → NR
D(x) → LE(x, nr)
NR → ACK(s(s(s(s(s(s(0)))))), 0)
IF(true, x) → D(s(x))
LE(s(x), s(y)) → LE(x, y)
numbers → d(0)
d(x) → if(le(x, nr), x)
if(true, x) → cons(x, d(s(x)))
if(false, x) → nil
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
nr → ack(s(s(s(s(s(s(0)))))), 0)
ack(0, x) → s(x)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
numbers
d(x0)
if(true, x0)
if(false, x0)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QDP
ACK(s(x), 0) → ACK(x, s(0))
ACK(s(x), s(y)) → ACK(s(x), y)
ACK(s(x), s(y)) → ACK(x, ack(s(x), y))
numbers → d(0)
d(x) → if(le(x, nr), x)
if(true, x) → cons(x, d(s(x)))
if(false, x) → nil
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
nr → ack(s(s(s(s(s(s(0)))))), 0)
ack(0, x) → s(x)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
numbers
d(x0)
if(true, x0)
if(false, x0)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDP
ACK(s(x), 0) → ACK(x, s(0))
ACK(s(x), s(y)) → ACK(s(x), y)
ACK(s(x), s(y)) → ACK(x, ack(s(x), y))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
ack(0, x) → s(x)
numbers
d(x0)
if(true, x0)
if(false, x0)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
numbers
d(x0)
if(true, x0)
if(false, x0)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
ACK(s(x), 0) → ACK(x, s(0))
ACK(s(x), s(y)) → ACK(s(x), y)
ACK(s(x), s(y)) → ACK(x, ack(s(x), y))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
ack(0, x) → s(x)
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
From the DPs we obtained the following set of size-change graphs:
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
LE(s(x), s(y)) → LE(x, y)
numbers → d(0)
d(x) → if(le(x, nr), x)
if(true, x) → cons(x, d(s(x)))
if(false, x) → nil
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
nr → ack(s(s(s(s(s(s(0)))))), 0)
ack(0, x) → s(x)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
numbers
d(x0)
if(true, x0)
if(false, x0)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
LE(s(x), s(y)) → LE(x, y)
numbers
d(x0)
if(true, x0)
if(false, x0)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
numbers
d(x0)
if(true, x0)
if(false, x0)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
LE(s(x), s(y)) → LE(x, y)
From the DPs we obtained the following set of size-change graphs:
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
D(x) → IF(le(x, nr), x)
IF(true, x) → D(s(x))
numbers → d(0)
d(x) → if(le(x, nr), x)
if(true, x) → cons(x, d(s(x)))
if(false, x) → nil
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
nr → ack(s(s(s(s(s(s(0)))))), 0)
ack(0, x) → s(x)
ack(s(x), 0) → ack(x, s(0))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
numbers
d(x0)
if(true, x0)
if(false, x0)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
D(x) → IF(le(x, nr), x)
IF(true, x) → D(s(x))
nr → ack(s(s(s(s(s(s(0)))))), 0)
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
ack(0, x) → s(x)
numbers
d(x0)
if(true, x0)
if(false, x0)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
numbers
d(x0)
if(true, x0)
if(false, x0)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
D(x) → IF(le(x, nr), x)
IF(true, x) → D(s(x))
nr → ack(s(s(s(s(s(s(0)))))), 0)
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(s(s(0)))))), 0)), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
D(x) → IF(le(x, ack(s(s(s(s(s(s(0)))))), 0)), x)
IF(true, x) → D(s(x))
nr → ack(s(s(s(s(s(s(0)))))), 0)
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
D(x) → IF(le(x, ack(s(s(s(s(s(s(0)))))), 0)), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
nr
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
nr
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(s(s(0)))))), 0)), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(s(0))))), s(0))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(s(0))))), s(0))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(s(s(0))))), 0))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(s(s(0))))), 0))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(s(0)))), s(0)))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(s(0)))), s(0)))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(s(s(0)))), 0)))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(s(s(0)))), 0)))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(s(0))), s(0))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(s(0))), s(0))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(s(s(s(0))), 0))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
IF(true, x) → D(s(x))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(s(s(s(0))), 0))))), x)
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(s(s(0)), s(0)))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(s(s(0)), s(0)))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(s(0), ack(s(s(0)), 0)))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(s(0), ack(s(s(0)), 0)))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(s(0), ack(s(0), s(0))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(s(0), ack(s(0), s(0))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(s(0), ack(0, ack(s(0), 0))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(s(0), ack(0, ack(s(0), 0))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(s(0), s(ack(s(0), 0))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(s(0), s(ack(s(0), 0))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(0, ack(s(0), ack(s(0), 0))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), ack(0, ack(s(0), ack(s(0), 0))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), s(ack(s(0), ack(s(0), 0))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(s(0)), s(ack(s(0), ack(s(0), 0))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(s(0)), ack(s(0), ack(s(0), 0))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(s(0)), ack(s(0), ack(s(0), 0))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(s(0)), ack(s(0), ack(0, s(0)))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(s(0)), ack(s(0), ack(0, s(0)))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(s(0)), ack(s(0), s(s(0)))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
IF(true, x) → D(s(x))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(s(0)), ack(s(0), s(s(0)))))))), x)
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(s(0)), ack(0, ack(s(0), s(0)))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(s(0)), ack(0, ack(s(0), s(0)))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(s(0)), s(ack(s(0), s(0)))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(s(0)), s(ack(s(0), s(0)))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(s(0)), ack(s(0), s(0)))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(s(0)), ack(s(0), s(0)))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(s(0)), ack(0, ack(s(0), 0)))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(s(0)), ack(0, ack(s(0), 0)))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(s(0)), s(ack(s(0), 0)))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(s(0)), s(ack(s(0), 0)))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(s(0)), ack(s(0), 0)))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(s(0)), ack(s(0), 0)))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(s(0)), ack(0, s(0))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(s(0)), ack(0, s(0))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(s(0)), s(s(0))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(s(0)), s(s(0))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(s(0)), s(0))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(s(0)), s(0))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(s(0)), 0))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(s(0)), 0))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), s(0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), s(0)))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(0, ack(s(0), 0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(0, ack(s(0), 0)))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), s(ack(s(0), 0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), s(ack(s(0), 0)))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(0, ack(s(0), ack(s(0), 0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(0, ack(s(0), ack(s(0), 0)))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), s(ack(s(0), ack(s(0), 0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), s(ack(s(0), ack(s(0), 0)))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(0, ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(0, ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), s(ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), s(ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(0, ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(0, ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), s(ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(s(0), s(ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(0, ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), ack(0, ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), s(ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(s(0), s(ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(0, ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), ack(0, ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), s(ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
IF(true, x) → D(s(x))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(s(0))), s(ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), 0)))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(0, s(0))))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(0, s(0))))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), s(s(0))))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(s(0), s(s(0))))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(0, ack(s(0), s(0))))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
IF(true, x) → D(s(x))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), ack(0, ack(s(0), s(0))))))))))), x)
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), s(ack(s(0), s(0))))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(s(0), s(ack(s(0), s(0))))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(0, ack(s(0), ack(s(0), s(0))))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), ack(0, ack(s(0), ack(s(0), s(0))))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), s(ack(s(0), ack(s(0), s(0))))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(s(0), s(ack(s(0), ack(s(0), s(0))))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(0, ack(s(0), ack(s(0), ack(s(0), s(0))))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), ack(0, ack(s(0), ack(s(0), ack(s(0), s(0))))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), s(ack(s(0), ack(s(0), ack(s(0), s(0))))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
IF(true, x) → D(s(x))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(s(0), s(ack(s(0), ack(s(0), ack(s(0), s(0))))))))))), x)
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(0, ack(s(0), ack(s(0), ack(s(0), ack(s(0), s(0))))))))))), x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ RemovalProof
D(x) → IF(le(x, ack(s(s(s(s(0)))), ack(s(s(0)), ack(s(s(s(0))), ack(s(0), ack(0, ack(s(0), ack(s(0), ack(s(0), ack(s(0), s(0))))))))))), x)
IF(true, x) → D(s(x))
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
The new variable was added to all pairs as a new argument[13].
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
ack(0, x) → s(x)
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ RemovalProof
↳ QDP
↳ NonInfProof
IF(true, x, x_removed) → D(s(x), x_removed)
D(x, x_removed) → IF(le(x, x_removed), x, x_removed)
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))
(1) (IF(le(x2, x3), x2, x3)=IF(true, x4, x5) ⇒ IF(true, x4, x5)≥D(s(x4), x5))
(2) (le(x2, x3)=true ⇒ IF(true, x2, x3)≥D(s(x2), x3))
(3) (true=true ⇒ IF(true, 0, x12)≥D(s(0), x12))
(4) (le(x14, x15)=true∧(le(x14, x15)=true ⇒ IF(true, x14, x15)≥D(s(x14), x15)) ⇒ IF(true, s(x14), s(x15))≥D(s(s(x14)), s(x15)))
(5) (IF(true, 0, x12)≥D(s(0), x12))
(6) (IF(true, x14, x15)≥D(s(x14), x15) ⇒ IF(true, s(x14), s(x15))≥D(s(s(x14)), s(x15)))
(7) (D(s(x6), x7)=D(x8, x9) ⇒ D(x8, x9)≥IF(le(x8, x9), x8, x9))
(8) (D(s(x6), x7)≥IF(le(s(x6), x7), s(x6), x7))
POL(0) = 0
POL(D(x1, x2)) = -1 - x1 + x2
POL(IF(x1, x2, x3)) = -1 - x1 - x2 + x3
POL(c) = -2
POL(false) = 0
POL(le(x1, x2)) = 0
POL(s(x1)) = 1 + x1
POL(true) = 0
The following pairs are in Pbound:
IF(true, x, x_removed) → D(s(x), x_removed)
The following rules are usable:
IF(true, x, x_removed) → D(s(x), x_removed)
true → le(0, y)
false → le(s(x), 0)
le(x, y) → le(s(x), s(y))
↳ QTRS
↳ Overlay + Local Confluence
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ RemovalProof
↳ QDP
↳ NonInfProof
↳ QDP
↳ DependencyGraphProof
D(x, x_removed) → IF(le(x, x_removed), x, x_removed)
ack(s(x), s(y)) → ack(x, ack(s(x), y))
ack(s(x), 0) → ack(x, s(0))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
ack(0, x) → s(x)
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
ack(0, x0)
ack(s(x0), 0)
ack(s(x0), s(x1))